Intersection Types and Counting
نویسنده
چکیده
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground λ -term corresponds to some property of a derivation of a type for this λ -term, in this type system. Our approach is presented in the particular case of the language finiteness problem for nondeterministic higher-order recursion schemes (HORSes): given a nondeterministic HORS, decide whether the set of all finite trees generated by this HORS is finite. We give a type system such that the HORS can generate a tree of an arbitrarily large finite size if and only if in the type system we can obtain derivations that are arbitrarily large, in an appropriate sense; the latter condition can be easily decided.
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملBichromatic Line Segment Intersection Counting in O(n sqrt(log n)) Time
We give an algorithm for bichromatic line segment intersection counting that runs in O(n √ log n) time under the word RAM model via a reduction to dynamic predecessor search, offline point location, and offline dynamic ranking. This algorithm is the first to solve bichromatic line segment intersection counting in o(n log n) time.
متن کاملE cient Algorithms for Counting and Reporting Pairwise Intersections between Convex Polygons
Let S be a set of convex polygons in the plane with a total of n vertices, where a polygon consists of the boundary as well as the interior. E cient algorithms are presented for the problem of reporting output-sensitively (resp. counting) the I pairs of polygons that intersect. The algorithm for the reporting (resp. counting) problem runs in time O(n4=3+ +I) (resp. O(n4=3+ )), where > 0 is an a...
متن کاملEfficient Algorithms for Counting and Reporting Pairwise Intersections Between Convex Polygons
Let S be a set of convex polygons in the plane with a total of n vertices, where a polygon consists of the boundary as well as the interior. EEcient algorithms are presented for the problem of reporting output-sensitively (resp. counting) the I pairs of polygons that intersect. The algorithm for the reporting (resp. counting) problem runs in time O(n 4=3+ +I) (resp. O(n 4=3+)), where > 0 is an ...
متن کاملSuccinctness of Regular Expressions with Interleaving, Intersection and Counting
Studying the impact of operations, such as intersection and interleaving, on the succinctness of regular expressions has recently received renewed attention [12–14]. In this paper, we study the succinctness of regular expressions (REs) extended with interleaving, intersection and counting operators. We show that in a translation from REs with interleaving to standard regular expressions a doubl...
متن کاملCounting Ramified Coverings and Intersection Theory on Spaces of Rational Functions I (cohomology of Hurwitz Spaces)
The Hurwitz space is a compactification of the space of rational functions of a given degree. The Lyashko–Looijenga map assigns to a rational function the set of its critical values. It is known that the number of ramified coverings of CP by CP with prescribed ramification points and ramification types is related to the degree of the Lyashko–Looijenga map on various strata of the Hurwitz space....
متن کامل